Decision Procedures for Sequence Theories

Combining Decision Procedures for Sorted Theories

The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to be correct in the setting of unsorted first-order logic, some current implementations of it appear in tools that use a sorted input language. So far, however, there have been no theoretical results on the correctness ...

Combining Decision Procedures for Positive Theories Sharing Constructors

Combining Decision Procedures for Theories in Sorted Logics

The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to be correct in the setting of unsorted first-order logic, some current implementations of it appear in tools that use a sorted input language. So far, however, there have been no theoretical results on the correctness ...

Decision Procedures for CTL*

We give an overview over three serious attempts to devise an effective decision method for CTL∗, namely Emerson and Jutla’s automata-theoretic decision procedure, Reynolds’ tableau search method and our recent approach based on an infinite tableau system with natural rules and with global conditions on the branches.

Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures

Most of the work on the combination of uniication algorithms for the union of disjoint equational theories has been restricted to algorithms which compute nite complete sets of uniiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms which just decide solvability of uniication problems without computing uniiers. In this paper we des...